Policy-directed certificate retrieval
نویسندگان
چکیده
منابع مشابه
Policy-directed certificate retrieval
Any large scale security architecture that uses certificates to provide security in a distributed system will need some automated support for moving certificates around in the network. We believe that for efficiency, this automated support should be tied closely to the consumer of the certificates: the policy verifier. As a proof of concept, we have built QCM, a prototype policy language and ve...
متن کاملA Computational Framework for Certificate Policy Operations
The trustworthiness of any Public Key Infrastructure (PKI) rests upon the expectations for trust, and the degree to which those expectations are met. Policies, whether implicit as in PGP and SDSI/SPKI or explicitly required as in X.509, document expectations for trust in a PKI. The widespread use of X.509 in the context of global e-Science infrastructures, financial institutions, and the U.S. F...
متن کاملCertificate Policy Tool for Automated Cross-Certification
One of the main PKI problems is currently the lack of interoperability at international level, which is greatly dependent on the automation of the cross-certification procedure using Certificate Policies (CP). This paper addresses the above-mentioned need by presenting an XML-based tool for the automated development and comparison of CPs, with main emphasis on healthcare environments. The CP to...
متن کاملCertificate Retrieval and Validation in Online Systems
In order to more effectively deal with certificate management issues in PKIs, there is growing interest in supplementing offline X.509 PKI models with online services. The advantages of online services include a reduction of complexity on client devices and the centralisation of certificate processing policy. An analysis of the security requirements of online models will be presented. Proposed ...
متن کاملFully-Dynamic Recognition Algorithm and Certificate for Directed Cographs
This paper presents an optimal fully-dynamic recognition algorithm for directed cographs. Given the modular decomposition tree of a directed cograph G, the algorithm supports arc and vertex modification (insertion or deletion) in O(d) time where d is the number of arcs involved in the operation. Moreover, if the modified graph remains a directed cograph, the modular tree decomposition is update...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Software: Practice and Experience
سال: 2000
ISSN: 0038-0644,1097-024X
DOI: 10.1002/1097-024x(200012)30:15<1609::aid-spe334>3.0.co;2-5